package Tree;
import java.util.Objects;

class Person{
    public String id;
    public Person(String id){
        this.id = id;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Person person = (Person) o;
        return Objects.equals(id, person.id);
    }

    @Override
    public int hashCode() {
        return Objects.hash(id);
    }
}
public class HashBuck<K,V> {
    static class Node<K,V> {
        public K key;
        public V val;

        public Node<K,V> next;

        public Node(K key, V val){
            this.key = key;
            this.val = val;
        }
    }

    public Node<K,V>[] array;

    public int usedSize;
    public HashBuck(){
        array = (Node<K,V>[])new Node[10];
    }



    public void put(K key, V val){
        int hash = key.hashCode();
        int index = hash % array.length;
        Node<K,V> cur  = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                cur.val = val;
                return;
            }
            cur = cur.next;
        }
        Node<K,V> node =  new Node<>(key,val);
        node.next = array[index];
        array[index] = node;
        usedSize++;
    }

   public V get(K key){
        int hash = key.hashCode();
        int index = hash %  array.length;
        Node<K,V> cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                return cur.val;
            }
            cur = cur.next;
        }
        return null;
   }





}
